无监督的图像传输可用于医疗应用内和模式间转移，其中大量配对训练数据不丰富。为了确保从输入到目标域的结构映射，现有的未配对医疗图像转移的方法通常基于周期矛盾，由于学习了反向映射，导致了其他计算资源和不稳定。本文介绍了一种新颖的单向域映射方法，在整个培训过程中不需要配对数据。通过采用GAN体系结构和基于贴片不变性的新颖发电机损失来确保合理的转移。更确切地说，对发电机的输出进行了评估和比较，并在不同的尺度上进行了比较，这使人们对高频细节以及隐式数据增强进行了越来越多的关注。这个新颖的术语还提供了通过对斑块残差建模输入依赖性量表图来预测不确定性的机会。提出的方法在三个著名的医疗数据库上进行了全面评估。这些数据集的卓越精度与未配对图像转移的四种不同的最新方法相比，这表明了这种方法对不确定性感知的医学图像翻译的巨大潜力。建议的框架的实施在此处发布：https：//github.com/anger-man/unsupervise-image-image-transfer-and-uq。

本文提出了Mburst，这是一种新型的多模式解决方案，用于视听语音增强功能，该解决方案考虑了有关前额叶皮层和其他大脑区域的锥体细胞的最新神经系统发现。所谓的爆发传播实现了几个标准，以更加可行的方式解决信用分配问题：通过反馈来指导可塑性的标志和大小，并线性化反馈信号。 Mburst从这种能力中受益于学习嘈杂信号和视觉刺激之间的相关性，从而通过扩增相关信息和抑制噪声来归因于语音。通过网格语料库和基于Chime3的数据集进行的实验表明，Mburst可以将类似的掩模重建基于多模态反向传播基线，同时证明了出色的能量效率管理，从而降低了神经元的发射速率，以降低价值，最高为\ textbf {$ 70 \％$}降低。这样的功能意味着更可持续的实现，适合助听器或任何其他类似的嵌入式系统。

有充分的神经生物学证据表明，上下文敏感的新皮质神经元使用其顶端输入来放大相干进料（FF）输入的传播。但是，到目前为止，尚未证明这种已知机制如何提供有用的神经计算。在这里，我们首次展示了这种神经信息处理的处理和学习能力与哺乳动物新皮层的能力相匹配。具体而言，我们表明，由此类本地处理器组成的网络将冲突的信息传输到更高级别，并大大减少处理大量异质现实世界数据所需的活动量，例如在处理视听语音时，这些本地处理器使用这些本地处理器时看到唇部动作可有选择地放大这些动作产生的听觉信息的FF传输，反之亦然。由于这种机制比最佳可用的深神经网的最佳形式更有效率，因此它为理解大脑的神秘能量节能机制提供了逐步改变，并激发了设计增强形式的生物学上的机器学习算法的进步。

Ensemble learning combines results from multiple machine learning models in order to provide a better and optimised predictive model with reduced bias, variance and improved predictions. However, in federated learning it is not feasible to apply centralised ensemble learning directly due to privacy concerns. Hence, a mechanism is required to combine results of local models to produce a global model. Most distributed consensus algorithms, such as Byzantine fault tolerance (BFT), do not normally perform well in such applications. This is because, in such methods predictions of some of the peers are disregarded, so a majority of peers can win without even considering other peers' decisions. Additionally, the confidence score of the result of each peer is not normally taken into account, although it is an important feature to consider for ensemble learning. Moreover, the problem of a tie event is often left un-addressed by methods such as BFT. To fill these research gaps, we propose PoSw (Proof of Swarm), a novel distributed consensus algorithm for ensemble learning in a federated setting, which was inspired by particle swarm based algorithms for solving optimisation problems. The proposed algorithm is theoretically proved to always converge in a relatively small number of steps and has mechanisms to resolve tie events while trying to achieve sub-optimum solutions. We experimentally validated the performance of the proposed algorithm using ECG classification as an example application in healthcare, showing that the ensemble learning model outperformed all local models and even the FL-based global model. To the best of our knowledge, the proposed algorithm is the first attempt to make consensus over the output results of distributed models trained using federated learning.

The task of out-of-distribution (OOD) detection is vital to realize safe and reliable operation for real-world applications. After the failure of likelihood-based detection in high dimensions had been shown, approaches based on the \emph{typical set} have been attracting attention; however, they still have not achieved satisfactory performance. Beginning by presenting the failure case of the typicality-based approach, we propose a new reconstruction error-based approach that employs normalizing flow (NF). We further introduce a typicality-based penalty, and by incorporating it into the reconstruction error in NF, we propose a new OOD detection method, penalized reconstruction error (PRE). Because the PRE detects test inputs that lie off the in-distribution manifold, it effectively detects adversarial examples as well as OOD examples. We show the effectiveness of our method through the evaluation using natural image datasets, CIFAR-10, TinyImageNet, and ILSVRC2012.

Object detection requires substantial labeling effort for learning robust models. Active learning can reduce this effort by intelligently selecting relevant examples to be annotated. However, selecting these examples properly without introducing a sampling bias with a negative impact on the generalization performance is not straightforward and most active learning techniques can not hold their promises on real-world benchmarks. In our evaluation paper, we focus on active learning techniques without a computational overhead besides inference, something we refer to as zero-cost active learning. In particular, we show that a key ingredient is not only the score on a bounding box level but also the technique used for aggregating the scores for ranking images. We outline our experimental setup and also discuss practical considerations when using active learning for object detection.

User-specific future activity prediction in the healthcare domain based on previous activities can drastically improve the services provided by the nurses. It is challenging because, unlike other domains, activities in healthcare involve both nurses and patients, and they also vary from hour to hour. In this paper, we employ various data processing techniques to organize and modify the data structure and an LSTM-based multi-label classifier for a novel 2-stage training approach (user-agnostic pre-training and user-specific fine-tuning). Our experiment achieves a validation accuracy of 31.58\%, precision 57.94%, recall 68.31%, and F1 score 60.38%. We concluded that proper data pre-processing and a 2-stage training process resulted in better performance. This experiment is a part of the "Fourth Nurse Care Activity Recognition Challenge" by our team "Not A Fan of Local Minima".

Context-sensitive two-point layer 5 pyramidal cells (L5PCs) were discovered as long ago as 1999. However, the potential of this discovery to provide useful neural computation has yet to be demonstrated. Here we show for the first time how a transformative L5PCs-driven deep neural network (DNN), termed the multisensory cooperative computing (MCC) architecture, can effectively process large amounts of heterogeneous real-world audio-visual (AV) data, using far less energy compared to best available 'point' neuron-driven DNNs. A novel highly-distributed parallel implementation on a Xilinx UltraScale+ MPSoC device estimates energy savings up to 245759 $ \times $ 50000 $\mu$J (i.e., 62% less than the baseline model in a semi-supervised learning setup) where a single synapse consumes $8e^{-5}\mu$J. In a supervised learning setup, the energy-saving can potentially reach up to 1250x less (per feedforward transmission) than the baseline model. The significantly reduced neural activity in MCC leads to inherently fast learning and resilience against sudden neural damage. This remarkable performance in pilot experiments demonstrates the embodied neuromorphic intelligence of our proposed cooperative L5PC that receives input from diverse neighbouring neurons as context to amplify the transmission of most salient and relevant information for onward transmission, from overwhelmingly large multimodal information utilised at the early stages of on-chip training. Our proposed approach opens new cross-disciplinary avenues for future on-chip DNN training implementations and posits a radical shift in current neuromorphic computing paradigms.

需要在机器学习模型中对最小参数设置的需求，以避免耗时的优化过程。$ k $ - 最终的邻居是在许多问题中使用的最有效，最直接的模型之一。尽管具有众所周知的性能，但它仍需要特定数据分布的$ K $值，从而需要昂贵的计算工作。本文提出了一个$ k $ - 最终的邻居分类器，该分类器绕过定义$ k $的值的需求。考虑到训练集的数据分布，该模型计算$ k $值。我们将提出的模型与标准$ K $ - 最近的邻居分类器和文献中的两个无参数版本进行了比较。11个公共数据集的实验证实了所提出方法的鲁棒性，因为所获得的结果相似甚至更好。

从不同扫描仪/部位的有丝分裂数字的检测仍然是研究的重要主题，这是由于其潜力协助临床医生进行肿瘤分级。有丝分裂结构域的概括（MIDOG）2022挑战旨在测试从多种扫描仪和该任务的多种扫描仪和组织类型中看不见数据的检测模型的鲁棒性。我们提供了TIA中心团队采用的方法来应对这一挑战的简短摘要。我们的方法基于混合检测模型，在该模型中，在该模型中进行了有丝分裂候选者，然后被深度学习分类器精炼。在训练图像上的交叉验证在初步测试集上达到了0.816和0.784的F1得分，这证明了我们模型可以从新扫描仪中看不见的数据的普遍性。